An Algorithm to Construct Gröbner Bases for Solving Integration by Parts Relations
نویسنده
چکیده
This paper is a detailed description of an algorithm based on a generalized Buchberger algorithm for constructing Gröbner-type bases associated with polynomials of shift operators. The algorithm is used for calculating Feynman integrals and has proven itself efficient in several complicated cases. E-mail: [email protected] Supported in part by RFBR, grant 05-01-00988
منابع مشابه
Applying Mellin-Barnes technique and Gröbner bases to the three-loop static potential
The Mellin–Barnes technique to evaluate master integrals and the algorithm called FIRE to solve IBP relations with the help of Gröbner bases are briefly reviewed. In FIRE, an extension of the classical Buchberger algorithm to construct Gröbner bases is combined with the well-known Laporta algorithm. It is explained how both techniques are used when evaluating the three-loop correction to the st...
متن کاملGröbner-Shirshov bases for Schreier extensions of groups
In this paper, by using the Gröbner-Shirshov bases, we give characterizations of the Schreier extensions of groups when the group is presented by generators and relations. An algorithm to find the conditions of a group to be a Schreier extension is obtained. By introducing a special total order, we obtain the structure of the Schreier extension by an HNN group.
متن کاملAn Efficient Numerical Algorithm For Solving Linear Differential Equations of Arbitrary Order And Coefficients
Referring to one of the recent works of the authors, presented in~cite{differentialbpf}, for numerical solution of linear differential equations, an alternative scheme is proposed in this article to considerably improve the accuracy and efficiency. For this purpose, triangular functions as a set of orthogonal functions are used. By using a special representation of the vector forms of triangula...
متن کاملOn Gröbner Bases in the Context of Satisfiability-Modulo-Theories Solving over the Real Numbers (Extended Version)
We address satisfiability checking for the first-order theory of the real-closed field (RCF) using satisfiability-modulo-theories (SMT) solving. SMT solvers combine a SAT solver to resolve the Boolean structure of a given formula with theory solvers to verify the consistency of sets of theory constraints. In this paper, we report on an integration of Gröbner bases as a theory solver so that it ...
متن کاملSolving Recurrence Relations for Multi-Loop Feynman Integrals
We study the problem of solving integration-by-parts recurrence relations for a given class of Feynman integrals which is characterized by an arbitrary polynomial in the numerator and arbitrary integer powers of propagators, i.e., the problem of expressing any Feynman integral from this class as a linear combination of master integrals. We show how the parametric representation invented by Baik...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006